New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Match analysis process became 200X faster in Windows OS #84

Merged

jaebeom-kim merged 5 commits into steineggerlab:master from jaebeom-kim:windows

Aug 31, 2024

Member

jaebeom-kim commented Aug 29, 2024

Fixed a bug in remainConsecutiveMatches
- It will change results slightly due to corrected score calculation.
Previously, a graph that connects consecutive matches is constructed first, and the graph is traversed to find the best combination of matches. Now, the optimal match combination is found directly. It is the main point of speeding up.

jaebeom-kim added 5 commits

August 28, 2024 20:41


reduce using push_back

8a0a6e1


find optimal path and build match connectivity graph at the same time

d94db1e


find optimal path and build match connectivity graph at the same time

77b75af


find optimal path and build match connectivity graph at the same time

dedce1d


Match analysis process became 200X faster in Windows OS

ec4391e

jaebeom-kim merged commit 7d8f497 into steineggerlab:master

1 check passed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment